Polygonal path simplification with angle constraints

Polygonal path simplification with angle constraints

We present efficient geometric algorithms for simplifying polygonal paths in R2 and R3 that have angle constraints, improving by nearly a linear factor over the graph-theoretic solutions based on known techniques. The algorithms we present match the time bounds for their unconstrained counterparts. As a key step in our solutions, we formulate and solve an off-line ball exclusion search problem,...

Polygonal Chain Simplification with Small Angle Constraints

We consider the problem of simplifying an n-vertex polygonal chain with small angle constraints in R and R, thus closing the gap on the range of angles left in previous work on the problem. Specifically, we show that the min-# version of the polygonal chain simplification problem with small angle constraints can be solved in O(n) time and space in R, and in O(n log n) time, O(n) space in R.

Computing polygonal path simplification under area measures

In this paper, we consider the restricted version of the well-known 2D line simplification problem under area measures and for restricted version. We first propose a unified definition for both of sum-area and difference-area measures that can be used on a general path of n vertices. The optimal simplification runs in O(n) under both of these measures. Under sum-area measure and for a realistic...

Polygonal Simplification: An Overview

Quadric-Based Polygonal Surface Simplification

Many applications in computer graphics and related fields can benefit from automatic simplification of complex polygonal surface models. Applications are often confronted with either very densely over-sampled surfaces or models too complex for the limited available hardware capacity. An effective algorithm for rapidly producing high-quality approximations of the original model is a valuable too...